Research on Optimizing Selection and Optimizing Matching Technologies of Aeroengine Fan Rotor Blades

نویسندگان

چکیده

Aiming at the problem of low resources utilization rotating blades in selection process aeroengine fan rotor blades, this paper takes first-order bending dispersion, torque and gravitational moment difference as criteria minimum remaining optimization goal. An intelligent algorithm based on collocation degree is proposed achieves efficient full blades. multiple installations adjustments assembly success rate gravity two diagonal position 180° constraint residual unbalance objective, adopts improved simulated annealing to optimize sequence greatly reduces which beneficial reduce number The optimizing matching methods realize lays a foundation for reliability robustness quality service performance

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matching of Polygon Objects by Optimizing Geometric Criteria

Despite the semantic criteria, geometric criteria have different performances on polygon feature matching in different vector datasets. By using these criteria for measuring the similarity of two polygons in all matchings, the same results would not have been obtained. To achieve the best matching results, the determination of optimal geometric criteria for each dataset is considered necessary....

متن کامل

Optimizing and Matching Bitstrings

Strings of bits (bitstrings) are a common first-order representation in the design and preliminary investigation of computational intelligence algorithms given (1) the ease in mapping the strings to arbitrary domains (such as real numbers), and (2) in terms of mathematical analysis. This work considers the use of bitstrings in the context of the clonal expansion and antigenic selection in a gen...

متن کامل

Optimizing Disparity Candidates Space in Dense Stereo Matching

In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...

متن کامل

Image Matching Optimizing Approach Based on SIFT ⋆

In this paper we introduced an improved SIFT algorithm, which is used to embedded computer vision system. In order to reduce time cost and improve correct match rate, we replaced Gaussian filter with box filter to produce scale-space and used 3D quadratic instead of pixel differences in computing Hessian and gradient. We used second derivative to compute magnitude and orientation of interest po...

متن کامل

Optimizing DNS Server Selection

In DNS zone delegation, the NS resource records of the delegated domain appear in both the parent and child zones, which complicates the domain name resolution procedure especially for server selection. In this paper, we investigate the recursive resolution mechanism for the delegated domain and the necessary operations. As there are no specifications for such resolution, we provide some recomm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Shock and Vibration

سال: 2021

ISSN: ['1875-9203', '1070-9622']

DOI: https://doi.org/10.1155/2021/5595535